Interacting with Huge Hierarchies: Beyond Cone Trees
نویسندگان
چکیده
This paper describes an implementation of a tool for visualizing and interacting with huge information hierarchies, and some preliminary empirical evaluation of the tool’s efficacy. Existing systems for visualizing huge hierarchies using cone trees ‘‘break down” once the hierarchy to be displayed exceeds roughly 1000 nodes, due to increasing visual clutter. This paper describes a system called fsviz which visualizes arbitrarily large hierarchies while retaining user control. This is accomplished by augmenting cone trees with several graphical and interaction techniques: usage-based filtering, animated zooming, hand-coupled rotation, fish-eye zooming, coalescing of distant nodes, texturing, effective use of colour for depth cueing, and the applications of dynamic queries. The fsviz system also improves upon earlier cone tree visualization systems through a more elaborate node layout algorithm. This algorithm enhances the usefulness of cone tree visualization for large hierarchies by all but eliminating clutter.
منابع مشابه
Constructing phylogenetic trees using interacting pathways
Phylogenetic trees are used to represent evolutionary relationships among biological species or organisms. The construction of phylogenetic trees is based on the similarities or differences of their physical or genetic features. Traditional approaches of constructing phylogenetic trees mainly focus on physical features. The recent advancement of high-throughput technologies has led to accumulat...
متن کاملSymmetric Tensor Approximation Hierarchies for the Completely Positive Cone
In this paper we construct two approximation hierarchies for the completely positive cone based on symmetric tensors. We show that one hierarchy corresponds to dual cones of a known polyhedral approximation hierarchy for the copositive cone, and the other hierarchy corresponds to dual cones of a known semidefinite approximation hierarchy for the copositive cone. As an application, we consider a...
متن کاملDynamic 3D Visualization of Database-Defined Tree Structures on the WWW by Using Rewriting Systems
This paper presents a new Web-based technique for visualizing dynamically large hierarchies, tree or category structures in 3D worlds. The technique uses CGI-scripting, SQL queries and Applet-based production systems to visualize in an efficient and versatile manner general category structures that are stored in relational databases. First, appropriate SQL queries extract the hierarchical categ...
متن کاملReconfigurable Disc Trees for Visualizing Large Hierarchical Information Space
We present a new visualization technique, called (Reconfigurable Disc Tree) which can alleviate the disadvantages of cone trees significantly for large hierarchies while maintaining its context of using 3D depth. In , each node is associated with a disc around which its children are placed. Using discs instead of cones as the basic shape in has several advantages: significant reduction of occlu...
متن کاملDISTRIBUTION STATEMENT A. Approved for public release. 1 IMPLICATIONS OF HIERARCHIES FOR RSO RECOGNITION, IDENTIFICATION, AND CHARACTERIZATION
In our previous work, we demonstrated that hierarchical (taxonomical) trees can be used to depict hypotheses in a Bayesian object recognition and identification process using Figaro, an open source probabilistic programming language. We assume in this work that we have appropriately defined a satellite taxonomy that allows us to place a given space object (RSO) into a particular class of object...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995